Methods for securing files within a storage device using artificial intelligence and devices thereof

ABSTRACT

The present technology relates to identifying an artificial intelligence model based on a received first key value to write a received first block of data associated with a file. The received first key value is applied to the identified artificial intelligence model which is trained to output one of a plurality of actual index values where the identified artificial intelligence model and the plurality of data blocks are stored as a neural tree. The one of the actual index values is compared to a range within the actual index values to determine when the one of the actual index value points to a first data block of the plurality of data. The received first block of data associated with the file is written into the determined first data block.

FIELD

The present technology pertains to the field of storage management, and particularly, directed to a method for securing files within a storage device using machine learning techniques and devices.

BACKGROUND

In storage management, file systems are used to control how data is stored and retrieved. Unfortunately, the structure of prior file systems can easily be determined as they are both static and document. Accordingly, with that understanding a nefarious device can easily reconstruct one or more files stored within the file system. As a result, there exists a problem with these prior file systems on how to securely store files in a manner that prevents this type of easy reconstruction.

Prior attempts to address this problem have focused on encrypting the entire file system. Unfortunately, encrypting the entire file system is not entirely secure because a nefarious device can still access the entire file system when the file system is decrypted and therefore can still reconstruct files stored within the file system, as well as undesirably results in the data loss domain being the entire file system.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of a network environment with exemplary data storage apparatuses each including a node computing device;

FIG. 2 is a block diagram of an exemplary one of the node computing devices shown in FIG. 1 ;

FIG. 3 is a flowchart of an exemplary method for training a neural network;

FIG. 4A-4B are exemplary graphs illustrating training of a neural network;

FIG. 5 is an exemplary data flow diagram representing inputting a key value into the neural network and obtaining an output value as an index;

FIG. 6 is an exemplary block diagram illustrating a neural tree;

FIG. 7 is an exemplary flowchart illustrating a method of securing data to be written into a data block using an artificial intelligence model;

FIG. 8 is an exemplary dataflow diagram illustrating the method of securing data to be written into a data block using an artificial intelligence model;

FIGS. 9-11 are exemplary block diagrams representing data blocks written and represented as a neural tree;

FIG. 12 is an exemplary flowchart illustrating processing a data block search request using an artificial intelligence model;

FIG. 13 is an exemplary dataflow diagram illustrating processing a data block search request using an artificial intelligence model; and

FIG. 14 is an exemplary block diagram representing search of data blocks in a neural tree.

DETAILED DESCRIPTION

A clustered network environment 100 that may implement one or more aspects of the technology described and illustrated herein is shown in FIG. 1 . The clustered network environment 100 includes data storage apparatuses 102(1)-102(n) that are coupled over a cluster fabric 104 facilitating communication between the data storage apparatuses 102(1)-102(n) (and one or more modules, components, etc. therein, such as, node computing devices 106(1)-106(n), for example), although any number of other elements or components can also be included in the clustered network environment 100 in other examples.

This technology provides a number of advantages including methods, non-transitory computer readable media, and devices that more effectively and efficiently secure files within a storage device through the application of specifically trained artificial intelligence models. With the disclosed technology, a self-securing and dynamically programmable data structure, such as a neural tree, is utilized. In particular, examples of the disclosed technology use trained artificial intelligence models and stores data blocks in the dynamically programmable data structure, such as a neural tree, to secure the files within a file system. Additionally, the disclosed technology encrypts the data blocks as opposed to the entire file system thereby being more efficient while also preventing the prior reconstruction issue.

In this example, node computing devices 106(1)-106(n) can be primary or local storage controllers or secondary or remote storage controllers that provide client devices 108(1)-108(n), with access to data stored within data storage devices 110(1)-110(n). Additionally in this example, the node computing devices 106(1)-106(n) can obtain or receive training data to train the neural network(s) from training data servers 130(1)-130(n), although the training data can be obtained or received from other locations. The data storage apparatuses 102(1)-102(n) and/or node computing device 106(1)-106(n) of the examples described and illustrated herein are not limited to any particular geographic areas and can be clustered locally and/or remotely. Thus, in one example the data storage apparatuses 102(1)-102(n) and/or node computing device 106(1)-106(n) can be distributed over a plurality of storage systems located in a plurality of geographic locations. In another example, a clustered network can include data storage apparatuses 102(1)-102(n) and/or node computing device 106(1)-106(n) residing in a same geographic location (e.g., in a single onsite rack).

In the illustrated example, one or more of the client devices 108(1)-108(n), which may be, for example, personal computers (PCs), computing devices or storage (e.g., storage servers), and other computers or peripheral devices, are coupled to the respective data storage apparatuses 102(1)-102(n) by storage network connections 112(1)-112(n). Network connections 112(1)-112(n) may include a local area network (LAN) or wide area network (WAN), for example, that utilizes Network Attached Storage (NAS) protocols, such as a Common Internet File System (CIFS) protocol or a Network File System (NFS) protocol to exchange data packets, a Storage Area Network (SAN) protocol, such as Small Computer System Interface (SCSI) or Fiber Channel Protocol (FCP), an object protocol, such as S3, etc.

Illustratively, the client devices 108(1)-108(n) may be general-purpose computers running applications, and may interact with the data storage apparatuses 102(1)-102(n) using a client/server model for exchange of information. That is, the client devices 108(1)-108(n) may request data from the data storage apparatuses 102(1)-102(n) (e.g., data on one of the data storage devices 110(1)-110(n) managed by a network storage controller configured to process I/O commands issued by the client devices 108(1)-108(n)), and the data storage apparatuses 102(1)-102(n) may return results of the request to the client devices 108(1)-108(n) via the storage network connections 112(1)-112(n).

The training data servers 130(1)-130(n) may be general-purpose computers running applications, and may interact with the data storage apparatuses 102(1)-102(n) using a client/server model for exchange of information. That is, the training data servers 130(1)-130(n) may provide data to the data storage apparatuses 102(1)-102(n) (e.g., data on one of the data storage devices 110(1)-110(n) managed by a network storage control configured to process I/O commands issued by the node computing devices 106(1)-106(n)), and the training data servers 130(1)-130(n) may return results of the request to the data storage apparatuses 102(1)-102(n) via the storage network connections 112(1)-112(n).

The node computing devices 106(1)-106(n) of the data storage apparatuses 102(1)-102(n) can include network or host nodes that are interconnected as a cluster to provide data storage and management services, such as to an enterprise having remote locations, cloud storage (e.g., a storage endpoint may be stored within a data cloud), etc., for example. Such a node computing device 106(1)-106(n) can be a device attached to the fabric 104 as a connection point, redistribution point, or communication endpoint, for example. One or more of the node computing devices 106(1)-106(n) may be capable of sending, receiving, and/or forwarding information over a network communications channel, and could comprise any type of device that meets any or all of these criteria.

In an example, the node computing device 106(1) may be located on a first storage site and the node computing device 106(n) may be located at a second storage site. The node computing devices 106(1) and 106(n) may be configured according to a disaster recovery configuration whereby a surviving node provides switchover access to the storage devices 110(1)-110(n) in the event a disaster occurs at a disaster storage site (e.g., the node computing device 106(1) provides client device 108(n) with switchover data access to storage devices 110(n) in the event a disaster occurs at the second storage site). In other examples, the node computing device 106(n) can be configured according to an archival configuration and/or the node computing devices 106(1)-106(n) can be configured based on another type of replication arrangement (e.g., to facilitate load sharing). Additionally, while two node computing devices 106 are illustrated in FIG. 1 , any number of node computing devices or data storage apparatuses can be included in other examples in other types of configurations or arrangements.

As illustrated in the clustered network environment 100, node computing devices 106(1)-106(n) can include various functional components that coordinate to provide a distributed storage architecture. For example, the node computing devices 106(1)-106(n) can include network modules 114(1)-114(n) and disk modules 116(1)-116(n). Network modules 114(1)-114(n) can be configured to allow the node computing devices 106(1)-106(n) (e.g., network storage controllers) to connect with client devices 108(1)-108(n) and the training data servers 130(1)-130(n) over the storage network connections 112(1)-112(n), for example, allowing the client devices 108(1)-108(n) to access data stored and to obtain training data from the training data servers 130(1)-130(n) in the clustered network environment 100.

Further, the network modules 114(1)-114(n) can provide connections with one or more other components through the cluster fabric 104. For example, the network module 114(1) of node computing device 106(1) can access the data storage device 110(n) by sending a request via the cluster fabric 104 through the disk module 116(n) of node computing device 106(n) when the node computing device 106(n) is available. Alternatively, when the node computing device 106(n) fails, the network module 114(1) of node computing device 106(1) can access the data storage device 110(n) directly via the cluster fabric 104. The cluster fabric 104 can include one or more local and/or wide area computing networks embodied as Infiniband, Fibre Channel (FC), or Ethernet networks, for example, although other types of networks supporting other protocols can also be used.

Disk modules 116(1)-116(n) can be configured to connect data storage devices 110(1)-110(n), such as disks or arrays of disks, SSDs, flash memory, or some other form of data storage, to the node computing devices 106(1)-106(n). Often, disk modules 116(1)-116(n) communicate with the data storage devices 110(1)-110(n) according to the SAN protocol, such as SCSI, FCP, SAS, NVMe, NVMe-oF for example, although other protocols can also be used. Thus, as seen from an operating system on node computing devices 106(1)-106(n), the data storage devices 110(1)-110(n) can appear as locally attached. In this manner, different node computing devices 106(1)-106(n), etc. may access data blocks through the operating system, rather than expressly requesting abstract files.

While the clustered network environment 100 illustrates an equal number of network modules 114(1)-114(n) and disk modules 116(1)-116(n), other examples may include a differing number of these modules. For example, there may be a plurality of network and disk modules interconnected in a cluster that do not have a one-to-one correspondence between the network and disk modules. That is, different node computing devices can have a different number of network and disk modules, and the same node computing device can have a different number of network modules than disk modules.

Further, one or more of the client devices 108(1)-108(n) and server devices 130(1)-130(n) can be networked with the node computing devices 106(1)-106(n) in the cluster, over the storage connections 112(1)-112(n). As an example, respective client devices 108(1)-108(n) that are networked to a cluster may request services (e.g., exchanging of information in the form of data packets) of node computing devices 106(1)-106(n) in the cluster, and the node computing devices 106(1)-106(n) can return results of the requested services to the client devices 108(1)-108(n). In one example, the client devices 108(1)-108(n) can exchange information with the network modules 114(1)-114(n) residing in the node computing devices 106(1)-106(n) (e.g., network hosts) in the data storage apparatuses 102(1)-102(n).

In one example, the storage apparatuses 102(1)-102(n) host aggregates corresponding to physical local and remote data storage devices, such as local flash or disk storage in the data storage devices 110(1)-110(n), for example. One or more of the data storage devices 110(1)-110(n) can include mass storage devices, such as disks of a disk array. The disks may comprise any type of mass storage devices, including but not limited to magnetic disk drives, flash memory, SSDs, storage class memories and any other similar media adapted to store information, including, for example, data (D) and/or parity (P) information.

The aggregates include volumes 118(1)-118(n) in this example, although any number of volumes can be included in the aggregates. The volumes 118(1)-118(n) are virtual data stores that define an arrangement of storage and one or more file systems within the clustered network environment 100. Volumes 118(1)-118(n) can span a portion of a disk or other storage device, a collection of disks, or portions of disks, for example, and typically define an overall logical arrangement of file storage. In one example volumes 118(1)-118(n) can include stored data as one or more files or objects that reside in a hierarchical directory structure within the volumes 118(1)-118(n). Volumes 118(1)-118(n) are typically configured in formats that may be associated with particular storage systems, and respective volume formats typically comprise features that provide functionality to the volumes 118(1)-118(n), such as providing an ability for volumes 118(1)-118(n) to form clusters.

In one example, to facilitate access to data stored on the disks or other structures of the data storage device 110(1)-110(n), a file system (e.g., write anywhere file system) may be implemented that logically organizes the information as a hierarchical structure of directories and files. In this example, respective files may be implemented as a set of disk blocks configured to store information, whereas directories may be implemented as specially formatted files in which information about other files and directories are stored.

Data can be stored as files or objects within a physical volume and/or a virtual volume, which can be associated with respective volume identifiers, such as file system identifiers (FSIDs). The physical volumes correspond to at least a portion of physical storage devices, such as the data storage device 110(1)-110(n) (e.g., a Redundant Array of Independent (or Inexpensive) Disks (RAID system)) whose address, addressable space, location, etc. does not change. Typically the location of the physical volumes does not change in that the (range of) address(es) used to access it generally remains constant.

Virtual volumes, in contrast, are stored over an aggregate of disparate portions of different physical storage devices. Virtual volumes may be a collection of different available portions of different physical storage device locations, such as some available space from disks, for example. It will be appreciated that since the virtual volumes are not “tied” to any one particular storage device, virtual volumes can be said to include a layer of abstraction or virtualization, which allows them to be resized and/or flexible in some regards.

Further, virtual volumes can include one or more logical unit numbers (LUNs), directories, Qtrees, and/or files. Among other things, these features, but more particularly the LUNS, allow the disparate memory locations within which data is stored to be identified, for example, and grouped as a data storage unit. As such, the LUNs may be characterized as constituting a virtual disk or drive upon which data within the virtual volumes is stored within an aggregate. For example, LUNs are often referred to as virtual disks, such that they emulate a hard drive, while they actually comprise data blocks stored in various parts of a volume.

In one example, the data storage devices 110(1)-110(n) can have one or more physical ports, wherein each physical port can be assigned a target address (e.g., SCSI target address). To represent respective volumes, a target address on the data storage devices 110(1)-110(n) can be used to identify one or more of the LUNs. Thus, for example, when one of the node computing devices 106(1)-106(n) connects to a volume, a connection between the one of the node computing devices 106(1)-106(n) and one or more of the LUNs underlying the volume is created.

In one example, respective target addresses can identify multiple of the LUNs, such that a target address can represent multiple volumes. The I/O interface, which can be implemented as circuitry and/or software in a storage adapter or as executable code residing in memory and executed by a processor, for example, can connect to volumes by using one or more addresses that identify the one or more of the LUNs.

Referring to FIG. 2 , node computing device 106(1) in this particular example includes processor(s) 200, a memory 202, a network adapter 204, a cluster access adapter 206, and a storage adapter 208 interconnected by a system bus 210. The node computing device 106 also includes a storage operating system 212 installed in the memory 206 that can, for example, implement a Redundant Array of Independent (or Inexpensive) Disks (RAID) data loss protection and recovery scheme to optimize a reconstruction process of data of a failed disk or drive in an array. In some examples, the node computing device 106(n) is substantially the same in structure and/or operation as node computing device 106(1), although the node computing device 106(n) can include a different structure and/or operation in one or more aspects than the node computing device 106(1) in other examples.

The storage operating system 212 can also manage communications for the node computing device 106(1) among other devices that may be in a clustered network, such as attached to a cluster fabric 104. Thus, the node computing device 106(1) can respond to client device requests to manage data on one of the data storage devices 110(1)-110(n) (e.g., or additional clustered devices) in accordance with the client device requests.

The storage operating system 212 can also establish one or more file systems including software code and data structures that implement a persistent hierarchical namespace of files and directories, for example. As an example, when a new data storage device (not shown) is added to a clustered network system, the storage operating system 212 is informed where, in an existing directory tree, new files associated with the new data storage device are to be stored. This is often referred to as “mounting” a file system.

In the example node computing device 106(1), memory 202 can include storage locations that are addressable by the processor(s) 200 and adapters 204, 206, and 208 for storing related software application code and data structures. The processor(s) 200 and adapters 204, 206, and 208 may, for example, include processing elements and/or logic circuitry configured to execute the software code and manipulate the data structures.

The storage operating system 212, portions of which are typically resident in the memory 202 and executed by the processor(s) 200, invokes storage operations in support of a file service implemented by the node computing device 106(1). Other processing and memory mechanisms, including various computer readable media, may be used for storing and/or executing application instructions pertaining to the techniques described and illustrated herein. For example, the storage operating system 212 can also utilize one or more control files (not shown) to aid in the provisioning of virtual machines.

Accordingly, the examples may be embodied as one or more non-transitory computer readable media having machine or processor-executable instructions stored thereon for one or more aspects of the present technology, as described and illustrated by way of the examples herein, which when executed by the processor(s) 200, cause the processor(s) 200 to carry out the steps necessary to implement the methods of this technology, as described and illustrated with the examples herein. In some examples, the executable instructions are configured to perform one or more steps of a method, such as one or more of the exemplary methods described and illustrated later with reference to FIGS. 3-14 , for example.

The network adapter 204 in this example includes the mechanical, electrical and signaling circuitry needed to connect the node computing device 106(1) to one or more of the client devices 108(1)-108(n) and one or more of the training data servers 130(1)-130(n) over storage network connections 112(1)-112(n), which may comprise, among other things, a point-to-point connection or a shared medium, such as a local area network. In some examples, the network adapter 204 further communicates (e.g., using TCP/IP) via the fabric 104 and/or another network (e.g. a WAN) (not shown) with cloud storage devices to process storage operations associated with data stored thereon.

The storage adapter 208 cooperates with the storage operating system 212 executing on the node computing device 106(1) to access information requested by one of the client devices 108(1)-108(n) (e.g., to access data on a data storage device 110(1)-110(n) managed by a network storage controller) or requests by one of the training data servers 130(1)-130(n). The information may be stored on any type of attached array of writeable media such as magnetic disk drives, SSDs, and/or any other similar media adapted to store information.

In the exemplary data storage devices 110(1)-110(n), information can be stored in data blocks on disks. The storage adapter 208 can include input/output (I/O) interface circuitry that couples to the disks over an I/O interconnect arrangement, such as a storage area network (SAN) protocol (e.g., Small Computer System Interface (SCSI), iSCSI, hyperSCSl, Fiber Channel Protocol (FCP)). The information is retrieved by the storage adapter 208 and, if necessary, processed by the processor(s) 200 (or the storage adapter 208 itself) prior to being forwarded over the system bus 210 to the network adapter 204 (and/or the cluster access adapter 206 if sending to another node computing device in the cluster) where the information is formatted into a data packet and returned to a requesting one of the client devices 108(1)-108(n), one of the requesting training data servers 130(1)-130(n), or alternatively received from one of the training data servers 130(1)-130(n), and/or sent to another node computing device attached via the cluster fabric 104. In some examples, a storage driver 214 in the memory 202 interfaces with the storage adapter to facilitate interactions with the data storage devices 110(1)-110(n), as described and illustrated in more detail later with reference to FIGS. 3-14 .

Referring to FIG. 3 , an exemplary method for training neural networks to perform input-output operations will now be described. At step 305, the node computing device 106(1) obtains training data from one of the plurality of training data servers 130(1)-130(n) to train neural networks residing within the data storage devices 110(1)-110(n), although the neural networks can reside at other memory locations and can obtain the data from other locations. In this example, each of the neural networks is a programmable function, y=f(x; w), that is parameterized by its weights, w. Further, in this example, the training data includes the values of x and y where x is a key (key is a string of bits) value that is received along with a read or write operation and y is the index value indicating the address of either the data required for the read or write operation or the address of another neural network. By way of example, FIGS. 4A-4B illustrates the exemplary values of x and w that can be used to train the neural network models with multiple layers to output the value of y.

Next in step 310, the node computing device 106(1) inputs one of the received keys in the training data to one of the neural networks present within the data storage devices 110(1)-110(n). By way of example and as illustrated in FIG. 5 , the node computing device 106(1) inputs a received key, X=10001, into the neural network, although the node computing device 106(1) can input other types of values into the neural network.

In step 313, the node computing device 106(1) obtains the output of the neural network. In this example, the output of the neural network provides an index value that either points to a data block or another neural network stored within the data storage devices 110(1)-110(n), although other types of outputs may be provided. By way of example and as illustrated in FIG. 5 , the output of the neural network is an index (Y=12345) to another neural network, although the output can also index to a data block in other examples.

In step 315, the node computing device 106(1) determines when the output obtained in step 313 from the neural network is equal to the index value that was obtained in the training data corresponding to the value of the key. By way of example, if the index value (y) obtained in the training data is 12345 and the output obtained in the step 313 is 12345, then the node computing device 106(1) would determine that the index value obtained as an output is equal to the index value that was obtained in the training data corresponding to the value of the key. In contrast, if the index value (y) obtained in the training data is 12345 and the output obtained in step 313 is 54321, then the node computing device 106(1) would determine that the index value obtained as an output is not equal to the index value that was obtained in the training data corresponding to the value of the key. Accordingly, when the node computing device 106(1) determines that the output obtained in step 313 from the neural network is not equal to the index value that was obtained in the training data corresponding to the value of the key, then the No branch is taken to step 320.

In step 320, the node computing device 106(1) trains the neural network to output the expected value of the index that is defined by the obtained training data. For example, if the expected value of the index is 12345 for an input key of 10001 and the neural network outputs 54321, then the node computing device 106(1) trains the neural network to output the index as 12345 for an input key value of 10001.

To train the neural network, the node computing device 106(1) uses the value of the input key such as 3.14, 2.71, 75.4, 2.14, 9.31 as illustrated in FIG. 4B, although the node computing device 106(1) can use other types of parameters to train the neural network. Additionally in this example, the neural networks are smaller neural networks with fewer weights and therefore requires less training data to train the neural network than in current approaches. As a result, training these particular neural networks in this example requires less than a millisecond making this training process very quick and efficient. The result of this training of the neural network is a trained artificial intelligence model for performing input-output operations. Next, in this example the flow may proceed back to step 310 described earlier.

However, if back in step 325 when the node computing device 106(1) determines that the output obtained in step 313 from the neural network is equal to the index value that was obtained in the training data corresponding to the value of the key, then the Yes branch is taken to step 325.

In step 325, the node computing device 106(1) classifies the neural network as fully trained and ready to be used as an artificial intelligence model. By way of example, FIG. 6 illustrates a fully trained neural network that is ready to be used as an artificial intelligence model. The fully trained neural network illustrated in FIG. 6 has been trained to accurately output the index value for each key value. For example, if the key value (X) is equal to 10001, then the neural network outputs an index that points to a second neural network. Subsequently when the key value (X) is used as an input to the second neural network, then output of the neural network indexes to the data blocks on which the read, write, or delete operations can be performed. Additionally in this example, the artificial intelligence model (or fully trained neural network) is physically stored within the disk module 116(n), although the artificial intelligence model can be stored at other memory locations. Further in this example, access to the storage media is only required when an artificial intelligence model is indexed to point to another artificial intelligence model that is stored in another model block; and by limiting the number of times the storage media is accessed, the disclosed technology is able to effectively utilize the processing cycles required for each media access. In other words, the artificial intelligence models can be arranged in a format that would regulate the media access and can be rearranged based on a storage policy. By way of example, a format that would regulate the media access can include an array, a queue, a linked list, a neural tree, or a binary tree, although other types or combinations of different data structures can be used to store the artificial intelligence models.

Next, an exemplary method to secure data to be written into a data block using a trained artificial intelligence model will now be illustrated using FIGS. 7-11 . In step 705, the node computing device 106(1) receives a key value and the data to be written into a file from a client device 108(1), although the node computing device 106(1) can receive other types or amounts of information from other devices. In this example, the data that is to be written into the file is encrypted data, although the data may not be encrypted in other examples.

In step 710, the node computing device 106(1) identifies the artificial model based on the received key value.

In step 715, the node computing device 106(1) provides the received key value to the identified artificial intelligence model.

In step 720, the node computing device 106(1) obtains the output from the identified artificial intelligence model. The output is the index that can point to another artificial intelligence model or a data block.

In step 725, the node computing device 106(1) determines when the output index from the identified artificial intelligence model points to a data block based on the value of the output index. Accordingly, when the output index is within the index range associated with the data block, the node computing device 106(1) determines that the index points to a data block. However, when the output index is within the index range associated with the artificial intelligence model, then the node computing device 106(1) determines that output index points to another artificial intelligence model. Accordingly, when the node computing device 106(1) determines that output index is within the artificial intelligence model, then then No branch is taken to step 730.

In step 730, the node computing device 106(1) traverses to another one of the artificial intelligence models (e.g., one or more other artificial intelligence models) that is pointed by the output index.

In step 735, the node computing device 106(1) provides another artificial intelligence model with the received key value and the exemplary flow proceeds to step 720 where the output of the another artificial intelligence model is obtained. In this example, the steps 720, 725, 730, and 735 may repeat until the output index points to a data block.

By way of example and with reference to FIGS. 8 and 9 , the node computing device 106(1) first receives a key value X=10001 and data block of a file to be written. Next, the node computing device 106(1) inputs the key value, X=10001 into the artificial intelligence model 1. Further, the node computing device 106(1) obtains an index value Y=12345 that points to block address that includes artificial intelligence model 3, although the block address can include data where the artificial intelligence model 3 can be found. Next, the node computing device 106(1) inputs the key value X=10001 to the artificial intelligence model 3 and obtains the output index value of Y=54321 from the artificial intelligence model 3. In this example, the output index value of Y=54321 points to a data block and therefore the key value X=10001 maps to physical block 54321.

However, if back in step 725, when the node computing device 106(1) determines that the output index from the artificial intelligence model points to the data block, then the Yes branch is taken to step 740.

In step 740, the node computing device 106(1) determines when the data block pointed to by the output index is above the storage threshold by comparing the current storage of the data block with the storage threshold (e.g., to determine whether the data block is full). In this example, the storage threshold relates to size of the data block to which the data can be written to. Accordingly, when the node computing device 106(1) determines that the data block is below the storage threshold (e.g., the data block is not yet full), then the Yes branch is taken to step 745.

In step 745, the node computing device 106(1) writes the data to the data block pointed by the output index. By way of example, the data written into a data block that is pointed by the index value Y=54321 is illustrated in FIGS. 8 and 9 . The exemplary flow proceeds to step 705 where the node computing device 106(1) receives a subsequent key value and data to write to an appropriate location.

However, if back in step 740, when the node computing device 106(1) determines that the data block pointed by the output index is above the storage threshold, then the Yes branch is taken to step 750.

In step 750, the node computing device 106(1) creates a new data block within the data storage device 110(1) and assigns a new index value indicating creation of a new data block.

In step 755, the node computing device 106(1) writes the received data in the newly created data block and the exemplary flow proceeds to step 760.

In step 760, the node computing device 106(1) trains the identified artificial intelligence model that pointed to the data block, with the received key value along with the index of the newly created data block such that the artificial intelligence model would point to the newly created data block for a subsequent input of the key value and the exemplary method proceeds back to step 705 where the node computing device 106(1) receives a subsequent key value and data to write to an appropriate location.

To continue with the example illustrated in FIG. 9 already discussed, the node computing device 106(1) receives a subsequent request for writing the data to be written from the client device 108(1) that will now be illustrated with reference to FIG. 10 . First, the node computing device 106(1) receives a key value X=20234 along with the second block of data to be written into the same file (e.g., as the data corresponding to key value X=10001 in FIG. 9 ) from the client device 108(1), although the node computing device 106(1) can receive other types or amounts of information. Next, the node computing device 106(1) provides the key value X=20234 to the artificial intelligence model 1 and obtains the output index value Y=90009 from the artificial intelligence model 1. In this example, the output index value Y=90009 points to a block address that includes another artificial intelligence model, i.e., artificial intelligence model 2. Next, the node computing device 106(1) provides the received key value of X=20234 to the artificial intelligence model 2 and obtains an output index value of Y=87069. In this example, the output index value of Y=87069 obtained from the artificial intelligence model 2 points to the data block 2. Next, the node computing device 106(1) proceeds to write the received subsequent data block into the data block pointed by the output index value of artificial intelligence model 2.

Similarly, the node computing device 106(1) performs the write data operation for all subsequent requests from the client device 108(1) and FIG. 11 represents the neural tree with the data blocks written for a file. In this example, the data blocks includes fragments of the file and combining the fragments in the different data blocks would result in the construction of the file. As illustrated in FIG. 11 , the data blocks associated with the file are present under data blocks that are pointed by different artificial intelligence models. By way of example, the artificial intelligence model 3 for a certain key value would point to the write data block 1 associated with file, artificial intelligence model 2 for a different key value would point to a write data block 2 associated with, and artificial intelligence model 7 for another key value would point to write data block 3 associated with file. By writing data associated with a file into different data blocks that are pointed by discrete key values inputted into different artificial intelligence models, the disclosed technology is able to prevent a file from being reconstructed by a nefarious device. In other words, this example of the disclosed technology stores the data blocks associated with a file in a non-sequential or discrete block address such that a nefarious device would not be able to reconstruct a file when a block address of one block of a file is obtained by the nefarious device. Alternatively, the discrete key values can also point to different data blocks associated with different files represented using different artificial intelligence models to prevent a file from being reconstructed by a nefarious device. Furthermore, if the artificial intelligence model can point to a data block if the input key value is (X), the same artificial intelligence model can be retrained to point to a data block for the same input key value (X). In other words, the artificial intelligence models can be periodically trained to point to different artificial intelligence model or a data block for the same input key value making the neural tree a dynamically changeable data structure. For an example illustrated in FIG. 10 , if a key value X=20234 entered into artificial intelligence model 1 is currently trained to point to artificial intelligence model 2, artificial intelligence model 1 can be retrained to point to artificial intelligence model 3 for the same key value X=20234.

Now, an exemplary method of processing a search data block request associated with a file using a trained artificial intelligence model will be illustrated using FIGS. 12-14 to access by a different client device. In step 1205, the node computing device 106(1) receives a key value from a different client device 108(2) (when compared to the client device 108(1)) attempting to reconstruct a file using different data blocks. As illustrated in FIG. 13 and by way of example, the key value X is equal 10001.

In step 1210, the node computing device 106(1) identifies an artificial intelligence model based on the received key value. In this example, the artificial intelligence models are associated with a range of key values and the node computing device 106(1) identifies the artificial intelligence model that corresponds to the received key value. By way of example, if the key value is between 10001 and 10050, then the node computing device 106(1) can identify artificial intelligence model 1 as the model to be selected for the aforementioned range of key values. Alternatively, the node computing device 106(1) can begin to identify one of the plurality of artificial intelligence models starting with the root model when the artificial intelligence models are arranged as a neural tree. As illustrated in FIG. 13 and by way of example, the node computing device 106(1) selects artificial intelligence model 1 for the received key value.

In step 1215, the node computing device 106(1) provides the received key value to the identified artificial intelligence model. As illustrated in FIG. 13 and by way of example, the node computing device 106(1) provides key value X equals 10001 to the artificial intelligence model 1.

In step 1220, the node computing device 106(1) obtains the output from the identified artificial intelligence model which is the index that can point to another block including another artificial intelligence model or a data block. As illustrated in FIG. 13 and by way of example, the node computing device 106(1) obtains the output index value Y=12345.

In step 1225, the node computing device 106(1) determines when the output index (Y=12345) from the identified artificial intelligence model falls within the range that points to a data block, although the node computing device 106(1) can use other techniques to make the determination. Accordingly, when the output index is within the index range associated with the data block, the node computing device 106(1) determines that the index points to a data block. However, when the output index is within the index range associated with the one of artificial intelligence models, then the node computing device 106(1) determines that the output index points to another artificial intelligence model. Thus, when the node computing device 106(1) determines that the output index is within one of the artificial intelligence models, then the No branch is taken to step 1230.

In step 1230, the node computing device 106(1) traverses to another artificial intelligence model that is pointed to by the output index. As illustrated in FIG. 13 and by way of example, the node computing device 106(1) traverses to artificial intelligence model 2.

In step 1235, the node computing device 106(1) provides the another artificial intelligence model with the received key value and the exemplary flow proceeds to step 1220 where the output of the another artificial intelligence model is obtained. In this example, the steps 1220, 1225, 1230, and 1235 repeats until the output index points to a data block. As illustrated in FIG. 13 and by way of example, the node computing device 106(1) provides the artificial intelligence model 2 with the received key value X=10001.

However, if back in step 1225, when the node computing device 106(1) determines that the output index from the artificial intelligence model points to the data block, then the Yes branch is taken to step 1240.

In step 1240, the node computing device 106(1) performs a binary search within the data block using the received key and the exemplary flow proceeds to step 1245, although other types of searches can be performed. During the binary search, the node computing device 106(1) finds the data that is associated with the provided key by repeatedly dividing in half the portion of the data block that could contain the data until narrowing down the possible locations to just one.

In step 1245, the node computing device 106(1) provides the requesting client device 108(2) with the searched data and the exemplary flow proceeds to step 1250. As illustrated in FIG. 13 and by way of example, the node computing device 106(1) provides the requesting client device 106(2) with the first data block associated with file.

In step 1250, the node computing device 106(1) receives second key value from a client device 108(2) and the exemplary flow proceeds back to step 1210 of FIG. 12 , although the node computing device 106(1) can receive other types or amounts of information. By way of example, the second key value is sequentially the next number from the first key value that was received in step 1205, although other types of key values can be received. In this example, the node computing device 106(1) executes steps 1210, 1215, 1220, 1225, 1240, 1245, and 1250 (and 1230, 1235 where appropriate) illustrated above for the second key value. As a response to the second key value, the node computing device 106(1) provides the requesting client device 108(2) with the first data block of file. Accordingly, the disclosed technology would return a data block that is associated with a different file for the next sequence number of the key value thereby preventing a file from being constructed. By way of example, if the requesting client computing device 108(2) provides the node computing device 106(1) with a key value equal to 10003, then the node computing device 106(1) returns the third data block associated with file 5 and so on.

Accordingly, as illustrated and described by way of the examples here, the above illustrated technology uses trained artificial intelligence models and stores data blocks as a neural tree to secure the files within a file system.

Having thus described the basic concept of the technology, it will be rather apparent to those skilled in the art that the foregoing detailed disclosure is intended to be presented by way of example only, and is not limiting. Various alterations, improvements, and modifications will occur and are intended to those skilled in the art, though not expressly stated herein. These alterations, improvements, and modifications are intended to be suggested hereby, and are within the spirit and scope of the technology. Additionally, the recited order of processing elements or sequences, or the use of numbers, letters, or other designations therefore, is not intended to limit the claimed processes to any order except as may be specified in the claims. Accordingly, the technology is limited only by the following claims and equivalents thereto. 

What is claimed is:
 1. A method implemented by a computing device and comprising: identifying first and second artificial intelligence models based on received first and second key values to write received first and second blocks of data associated with a file, respectively, wherein the first key value is different than the second key value; applying the first and second key values to the identified first and second artificial intelligence models, which are trained to output first and second actual index values of a plurality of actual index values, respectively, wherein each of the first and second actual index values points to another artificial intelligence model or a data block of a plurality of data blocks, wherein the identified artificial intelligence models, the another artificial intelligence model, and the plurality of data blocks are stored as a neural tree; determining that the first actual index value points to a first data block of the plurality of data blocks and the second actual index value points to the another artificial intelligence model by comparing each of the first and second actual index values to a range within the plurality of actual index values; applying the second key value to the another artificial intelligence model, which is trained to output a third actual index value of the plurality of actual index values; determining that the third actual index value points to a second data block of the plurality of data blocks by comparing the third actual index value to the range within the plurality of actual index values; and writing the received first and second blocks of data associated with the file into the determined first and second data blocks of the plurality of data blocks.
 2. The method as set forth in claim 1, wherein the received first block of data is encrypted.
 3. The method as set forth in claim 1, wherein the first data block and the second data block are arranged in the neural tree to prevent reconstruction of the file.
 4. The method as set forth in claim 1, wherein the neural tree is dynamically programmable to prevent reconstruction of the file.
 5. The method as set forth in claim 1 further comprising applying the first key value and a third key value to a plurality of artificial intelligence models to generate two different index values associated with different data blocks of different files.
 6. A non-transitory machine readable medium having stored thereon instructions comprising machine executable code which,. when executed by at least one machine, causes the machine to: identify first and second artificial intelligence models based on received first and second key values to write received first and second blocks of data associated with a file, respectively, wherein the first key value is different than the second key value; apply the first and second key values to the identified first and second artificial intelligence models, which are trained to output first and second actual index values of a plurality of actual index values, respectively, wherein each of the first and second actual index values points to another artificial intelligence model or a data block of a plurality of data blocks, wherein the identified artificial intelligence models, the another artificial intelligence model, and the plurality of data blocks are stored as a neural tree; determine that the first actual index value points to a first data block of the plurality of data blocks and the second actual index value points to the another artificial intelligence model by comparing each of the first and second actual index values to a range within the plurality of actual index values; apply the second key value to the another artificial intelligence model, which is trained to output a third actual index value of the plurality of actual index values; determine that the third actual index value points to a second data block of the plurality of data blocks by comparing the third actual index value to the range within the plurality of actual index values; and write the received first and second blocks of data associated with the file into the determined first and second data blocks of the plurality of data blocks.
 7. The non-transitory machine readable medium as set forth in claim 6, wherein the received first block of data is encrypted.
 8. The non-transitory machine readable medium as set forth in claim 6, wherein the first data block and the second data block are arranged in the neural tree to prevent reconstruction of the file.
 9. The non-transitory machine readable medium as set forth in claim 6, wherein the neural tree is dynamically programmable to prevent reconstruction of the file.
 10. The non-transitory machine readable medium as set forth in claim 6, wherein the machine executable code, when executed by the machine, further causes the machine to apply the first key value and a third key value to a plurality of artificial intelligence models to generate two different index values associated with different data blocks of different files.
 11. A computing device, comprising: a memory containing machine readable medium comprising machine executable code having stored thereon instructions; and a processor coupled to the memory, the processor configured to execute the machine executable code to cause the processor to: identify first and second artificial intelligence models based on received first and second key values to write received first and second blocks of data associated with a file, respectively, wherein the first key value is different than the second key value; apply the first and second key values to the identified first and second artificial intelligence models, which are trained to output first and second actual index values of a plurality of actual index values, respectively, wherein each of the first and second actual index values points to another artificial intelligence model or a data block of a plurality of data blocks, wherein the identified artificial intelligence models, the another artificial intelligence model, and the plurality of data blocks are stored as a neural tree; determine that the first actual index value points to a first data block of the plurality of data blocks and the second actual index value points to the another artificial intelligence model by comparing each of the first and second actual index values to a range within the plurality of actual index values; apply the second key value to the another artificial intelligence model, which is trained to output a third actual index value of the plurality of actual index values: determine that the third actual index value points to a second data block of the plurality of data blocks by comparing the third actual index value to the range within the plurality of actual index values; and write the received first and second blocks of data associated with the file into the determined first and second data blocks of the plurality of data blocks.
 12. The computing device as set forth in claim 11, wherein the received first block of data is encrypted.
 13. The computing device as set forth in claim 11, wherein the first data block and the second data block are arranged in the neural tree to prevent reconstruction of the file.
 14. The computing device as set forth in claim 11, wherein the neural tree is dynamically programmable to prevent reconstruction of the file.
 15. The computing device as set forth in claim 11, wherein the processor is further configured to execute the machine executable code to further cause the processor to apply the first key value and a third key value to a plurality of artificial intelligence models to generate two different index values associated with different data blocks of different files. 